60 research outputs found
THERE ARE INFINITELY MANY SMARANDACHE DERIVATIONS, INTEGRATIONS AND LUCKY NUMBERS
A number is said to be a Smarandache Lucky Number if an incorrect calculation leads to a correct result. In general, a Smarandache Lucky Method or Algorithm is said to be any incorrect method or algorithm, which leads to a correct result. In this note we find an infinite sequence of distinct lucky fractions
On the prime power factorization of n!
In this paper we prove two results. The first theorem uses a paper of Kim
\cite{K} to show that for fixed primes , and for fixed integers
, with , the numbers
are uniformly distributed modulo , where is the order
of the prime in the factorization of . That implies one of Sander's
conjecture from \cite{S}, for any set of odd primes. Berend \cite{B} asks to
find the fastest growing function so that for large and any given
finite sequence , there exists such
that the congruences hold for all . Here, is the th prime number.
In our second result, we are able to show that can be taken to be at
least , with some absolute constant ,
provided that only the first odd prime numbers are involved.Comment: 7 pages; accepted Journal of Number Theor
Landscape Boolean Functions
In this paper we define a class of Boolean and generalized Boolean functions
defined on with values in (mostly, we consider
), which we call landscape functions (whose class containing generalized
bent, semibent, and plateaued) and find their complete characterization in
terms of their components. In particular, we show that the previously published
characterizations of generalized bent and plateaued Boolean functions are in
fact particular cases of this more general setting. Furthermore, we provide an
inductive construction of landscape functions, having any number of nonzero
Walsh-Hadamard coefficients. We also completely characterize generalized
plateaued functions in terms of the second derivatives and fourth moments.Comment: 19 page
- β¦